Probability generating functions of absolute difference of two random variables.
نویسنده
چکیده
Communicated by Jerzy Neyman, August 1, 1966 1. All random variables considered in this note are nonnegative and integervalued. Generically, the probability generating functions (P. G. F.) of such variables are denoted by G with subscripts identifying the random variables concerned. The argument, or arguments of the P. G. F., denoted by either u or v, will be assumed to have their moduli less than unity. The note gives a simple formula for the P. G. F. of the absolute difference Z = i X2|, where X1 and X2 are arbitrary random variables of the kind considered. Later, this formula is used to obtain a characterization of the geometric distribution. The random variable Z appears in several domains of applications. See, for instance, David.1 2. THEOREM 1. Whatever be the random variables X1 and X2, we have = 1 (2I 1 -V2 *GS x(eiGe i)dO. (1) i(V) 2~r Jo 1+ v2-2v cosO 1, The theorem can be easily proved by first noticing that for vI < 1, 1 V2 co
منابع مشابه
Probability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملProbability Generating Functions for Discrete Real Valued Random Variables
The probability generating function is a powerful technique for studying the law of finite sums of independent discrete random variables taking integer positive values. For real valued discrete random variables, the well known elementary theory of Dirichlet series and the symbolic computation packages available nowadays, such as Mathematica 5 TM, allows us to extend to general discrete random v...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملA Probability Space based on Interval Random Variables
This paper considers an extension of probability space based on interval random variables. In this approach, first, a notion of interval random variable is introduced. Then, based on a family of continuous distribution functions with interval parameters, a concept of probability space of an interval random variable is proposed. Then, the mean and variance of an interval random variable are intr...
متن کاملDispersive Ordering and k-out-of-n Systems
Extended Abstract. The simplest and the most common way of comparing two random variables is through their means and variances. It may happen that in some cases the median of X is larger than that of Y, while the mean of X is smaller than the mean of Y. However, this confusion will not arise if the random variables are stochastically ordered. Similarly, the same may happen if one would like to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 56 4 شماره
صفحات -
تاریخ انتشار 1966